CLASSIFICATION OF TWO-REGULAR DIGRAPHS WITH MAXIMUM DIAMETER
نویسندگان
چکیده
منابع مشابه
Classification of Two-regular Digraphs with Maximum Diameter
The Klee-Quaife problem is finding the minimum order μ(d, c, v) of the (d, c, v) graph, which is a c-vertex connected v-regular graph with diameter d. Many authors contributed finding μ(d, c, v) and they also enumerated and classified the graphs in several cases. This problem is naturally extended to the case of digraphs. So we are interested in the extended Klee-Quaife problem. In this paper, ...
متن کاملRegular digraphs of diameter 2 and maximum order
It is known that Moore digraphs of degree d > 1 and diameter k > 1 do not exist (see [16] or [4]). For degree 2, it has been shown that for diameter k ~ 3 there are no digraphs of order 'close' to, i.e., one less than, the Moore bound (14). For diameter 2, it is known that digraphs close to Moore bound exist for any degree because the line digraphs of complete digraphs are an example of such di...
متن کاملClassification of Regular Digraphs, Normally Regular Digraphs, and Strongly Regular Digraphs
We use an exhaustive generation with isomorph-rejection to classify three types of structured digraphs. The first type is the class of regular digraphs where each vertex has the same number of out-neighbors and inneighbors. The second type is the class of normally regular digraphs introduced by Jørgensen. In these digraphs, the number of common out-neighbors (or inneighbors) of vertices x and y...
متن کاملRegular digraphs of diamter 2 and maximum order: Corrigenda
In [1], in and (10), each VI should be replaced by Vl q , where q is the second of the corresponding'\ and x. Additionally, on p. 300, V3 and V4 should be by V3,l and V4,1 Some changes are also necessary in Formulas 11 and 12 (p. 299) used in Theorem 2. o for I ~ 2, we have Cl q q=l q=l the correct version of Theorem 2 is: if l ~ 3 odd otherwise. Theorem 2 For the numbers ml permutation of leng...
متن کاملThe number of digraphs with small diameter
k) denote the l1um ber of of order nand diam-In this paper it is that: fixed k :~, ii) for every fixed k 1, n! where with D(n;d=n k:):Sn! (n) are polynomials of degree k 1 in n coefficients depending only on k. c;o:rres1)(:m(img results for undirected graphs given in [2]. of a vertex :r is the number of vertices of CJ that nr1PO'l'PP d-(x) is the number of vertices of G ~UII~~'~HU connected dig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Korean Journal of Mathematics
سال: 2012
ISSN: 1976-8605
DOI: 10.11568/kjm.2012.20.2.247